Superposition as a Decision Procedure for Timed Automata

نویسندگان

  • Arnaud Fietzke
  • Christoph Weidenbach
چکیده

The success of superposition-based theorem proving in first-order logic relies in particular on the fact that the superposition calculus is able to decide well-known classical decidable fragments of first-order logic and has been successful in identifying new decidable classes. In this paper, we extend this story to the hierarchic combination of linear arithmetic and first-order superposition. We show that decidability of reachability in timed automata can be obtained by instantiation of an abstract termination result for SUP(LA), the hierarchic combination of linear arithmetic and first-order superposition. Mathematics Subject Classification (2000). Primary 68T15; Secondary 03B25.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)

A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...

متن کامل

Back to the Future: Towards a Theory of Timed Regular Languages

Timed automata are nite-state machines constrained by timing requirements so that they accept timed words | words in which every symbol is labeled with a real-valued time. These automata were designed to lead to a theory of nite-state real-time properties with applications to the automatic veri cation of real-time systems. However, both deterministic and nondeterministic versions su er from dra...

متن کامل

Improved Undecidability Results for Reachability Games on Recursive Timed Automata

We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recent...

متن کامل

Interval Duration Logic: Expressiveness and Decidability

We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be capt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics in Computer Science

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2012